We prove that the cyclic and constacyclic codes constructed by Grassl and R\"otteler in arXiv:1502.05267 are generalised Reed-Solomon codes. This note can be considered as an addendum to that article. It can also be considered as an appendix to arXiv:2106.10180, where Conjecture 11 of arXiv:1502.0526, which was stated for Grassl-R\"otteler codes, is proven for generalised Reed-Solomon codes. The content of this note, together with arXiv:2106.10180, therefore implies that Conjecture 11 from arXiv:1502.0526 is true
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows...
AbstractLet us denote by (n, k, d; s)-code, an s-ary linear code C with code length n, k information...
In this paper, we consider the well-known unital embedding from $\FF_{q^k}$ into $M_k(\FF_q)$ seen a...
A new generalization of Reed-Solomon codes is given. This new generalization has similar information...
AbstractWe explicitly show that cyclic and pseudo-cyclic MDS codes of length q + 1, obtained by a BC...
AbstractMonomial matrices are constructed which transform doubly-extended Reed-Solomon codes into BC...
© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
AbstractLet A be the modular algebra in which a large class of extended cyclic codes is examined. We...
MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently,...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
Deux défis de la théorie du codage algébrique sont traités dans cette thèse. Le premier est le décod...
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co...
Recently, codes in the sum-rank metric attracted attention due to several applications in e.g. multi...
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows...
AbstractLet us denote by (n, k, d; s)-code, an s-ary linear code C with code length n, k information...
In this paper, we consider the well-known unital embedding from $\FF_{q^k}$ into $M_k(\FF_q)$ seen a...
A new generalization of Reed-Solomon codes is given. This new generalization has similar information...
AbstractWe explicitly show that cyclic and pseudo-cyclic MDS codes of length q + 1, obtained by a BC...
AbstractMonomial matrices are constructed which transform doubly-extended Reed-Solomon codes into BC...
© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
AbstractLet A be the modular algebra in which a large class of extended cyclic codes is examined. We...
MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently,...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
Deux défis de la théorie du codage algébrique sont traités dans cette thèse. Le premier est le décod...
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co...
Recently, codes in the sum-rank metric attracted attention due to several applications in e.g. multi...
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows...
AbstractLet us denote by (n, k, d; s)-code, an s-ary linear code C with code length n, k information...
In this paper, we consider the well-known unital embedding from $\FF_{q^k}$ into $M_k(\FF_q)$ seen a...